Robust formulations for economic lot-sizing problem with remanufacturing

نویسندگان

چکیده

In this paper, we consider a lot-sizing problem with the remanufacturing option under parameter uncertainties imposed on demands and returns. Remanufacturing has recently been fast growing area of interest for many researchers due to increasing awareness reducing waste in production environments, particular studies involving simultaneously are very scarce literature. We first present min-max decomposition approach problem, where decision maker’s adversarial treated iteratively. Then, propose two novel extended reformulations addressing some computational challenges. An original aspect is that they applied only latest scenario added problem. an extensive analysis, which provides detailed comparison three formulations evaluates impact key parameters. conclude proposed outperform standard formulation majority instances. also provide insights parameters performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Economic lot-sizing with remanufacturing: complexity and efficient formulations

Within the framework of reverse logistics, the classic economic lot-sizing problem has been extended with a remanufacturing option. In this extended problem, known quantities of used products are returned from customers in each period. These returned products can be remanufactured, so that they are as good as new. Customer demand can then be fulfilled both from newly produced and remanufactured...

متن کامل

Cost Sharing for the Economic Lot-Sizing Problem with Remanufacturing Options

We consider a new class of cooperative cost sharing games, associated with the economic lot-sizing problem with remanufacturing options (ELSR). As a preliminary step, we investigate the relative strength and integrality gaps of various mathematical optimization formulations of ELSR. Using insights from these results, we study the core of the associated cost sharing game. We show that the cost s...

متن کامل

A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option

In this paper, we propose a decomposition procedure for constructing robust optimal production plans for reverse inventory systems. Our method is motivated by the need of overcoming the excessive computational time requirements, as well as the inaccuracies caused by imprecise representations of problem parameters. The method is based on a min-max formulation that avoids the excessive conservati...

متن کامل

On the complexity of the economic lot-sizing problem with remanufacturing options

In this paper we investigate the complexity of the economic lot-sizing problem with remanufacturing (ELSR) options. Whereas in the classical economic lot-sizing problem demand can only be satisfied by production, in the ELSR problem demand can also be satisfied by remanufacturing returned items. Although the ELSR problem can be solved efficiently for some special cases, we show that the problem...

متن کامل

Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing

This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2021

ISSN: ['1872-6860', '0377-2217']

DOI: https://doi.org/10.1016/j.ejor.2020.06.016